An Efficient Heuristic Algorithm for Solving 0-1 Knapsack Problem
نویسندگان
چکیده
منابع مشابه
the algorithm for solving the inverse numerical range problem
برد عددی ماتریس مربعی a را با w(a) نشان داده و به این صورت تعریف می کنیم w(a)={x8ax:x ?s1} ، که در آن s1 گوی واحد است. در سال 2009، راسل کاردن مساله برد عددی معکوس را به این صورت مطرح کرده است : برای نقطه z?w(a)، بردار x?s1 را به گونه ای می یابیم که z=x*ax، در این پایان نامه ، الگوریتمی برای حل مساله برد عددی معکوس ارانه می دهیم.
15 صفحه اولA Heuristic for the Multidimensional 0-1 Knapsack Problem
This paper deals with the concepts of core and core problems for multidimensional 0-1 knapsack (MKP) problems. Core problems were introduced by Balas and Zemel (1980) and have been widely studied in the literature. The core refers to the seet of variables for which it is hard to decide what their value will be in an optimal solution; and the core problem is a reduction of the original problem i...
متن کاملAn Efficient Algorithm for Reducing the Duality Gap in a Special Class of the Knapsack Problem
A special class of the knapsack problem is called the separable nonlinear knapsack problem. This problem has received considerable attention recently because of its numerous applications. Dynamic programming is one of the basic approaches for solving this problem. Unfortunately, the size of state-pace will dramatically increase and cause the dimensionality problem. In this paper, an efficient a...
متن کاملAn Efficient Algorithm for Reducing the Duality Gap in a Special Class of the Knapsack Problem
A special class of the knapsack problem is called the separable nonlinear knapsack problem. This problem has received considerable attention recently because of its numerous applications. Dynamic programming is one of the basic approaches for solving this problem. Unfortunately, the size of state-pace will dramatically increase and cause the dimensionality problem. In this paper, an efficient a...
متن کاملAlienor Method for Solving the 0-1 Quadratic Knapsack Problem
The quadratic knapsack problem (QKP) is the problem of maximizing a quadratic objective function subject to a single knapsack constraint. It is a well-known NP-hard combinatorial problem. In this paper, we examine the use of Alienor method for solving QKP. Alienor method is a new global optimization algorithm based on a simple idea consisting in approximating an n variables function by a single...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Physics: Conference Series
سال: 2021
ISSN: 1742-6588,1742-6596
DOI: 10.1088/1742-6596/1865/4/042009